Forbidden subgraph pairs for traceability of block-chains
نویسندگان
چکیده
A block-chain is a graph whose block graph is a path, i.e. it is either a P1, a P2, or a 2-connected graph, or a graph of connectivity 1 with exactly two end-blocks. A graph is called traceable if it contains a Hamilton path. A traceable graph is clearly a block-chain, but the reverse does not hold in general. In this paper we characterize all pairs of connected graphs {R, S} such that every {R, S}-free block-chain is traceable.
منابع مشابه
Heavy subgraph pairs for traceability of block-chains
A graph is called traceable if it contains a Hamilton path, i.e., a pathcontaining all its vertices. Let G be a graph on n vertices. We say that aninduced subgraph of G is o−1-heavy if it contains two nonadjacent verticeswhich satisfy an Ore-type degree condition for traceability, i.e., with degreesum at least n−1 in G. A block-chain is a graph whose block graph is a path,<l...
متن کاملTraceability in graphs with forbidden triples of subgraphs
If 9 is a collection of connected graphs, and if a graph G does not contain any member of 9 as an induced subgraph, then G is said to be F-free. The members of f in this situation are called forbidden subgraphs. In a previous paper (Gould and Harris, 1995) the authors demonstrated two families of triples of subgraphs which imply traceability when forbidden. In this paper the authors identify tw...
متن کاملPairs of forbidden induced subgraphs for homogeneously traceable graphs
AgraphG is called homogeneously traceable if for every vertex v ofG,G contains aHamilton path starting from v. For a graphH , we say thatG isH-free ifG contains no induced subgraph isomorphic to H . For a family H of graphs, G is called H-free if G is H-free for every H ∈ H . Determining families of graphs H such that every H-free graph G has some graph property has been a popular research topi...
متن کاملForbidden subgraphs and the existence of a 2-factor
For a connected graph H, a graph G is said to be H-free if G does not contain an induced subgraph which is isomorphic to H, and for a set of connected graphs H, G is said to be H-free if G is H-free for every H ∈ H. The set H is called a forbidden subgraph. In particular, if |H| = 2 (resp. |H| = 3), we often call H a forbidden pair (resp. forbidden triple). In 1991, Bedrossian proved that there...
متن کاملCharacterizing forbidden pairs for hamiltonian properties 1
In this paper we characterize those pairs of forbidden subgraphs sufficient to imply various hamiltonian type properties in graphs. In particular, we find all forbidden pairs sufficient, along with a minor connectivity condition, to imply a graph is traceable, hamiltonian, pancyclic, panconnected or cycle extendable. We also consider the case of hamiltonian-connected graphs and present a result...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- EJGTA
دوره 1 شماره
صفحات -
تاریخ انتشار 2013